基于序列二次规划算法的控制律寻优设计

针对某型无人机设计的纵向控制系统,运用经典控制器设计,然后通过参数优化而进行时域自动调节控制律参数的方法设计控制律,优化算法采用序列二次规划法.自动调参的过程是直观可视的.仿真结果表明运用该方法所设计出的控制律满足飞行品质要求,比传统的人工调节控制器参数效果更好,并提高了工作效率.这种方法可以应用于其他控制对象.     

分段供电六相圆筒式直线感应电动机数学模型

为研究新型分段供电六相圆筒式直线感应电动机的运行规律,针对其不对称运行的特点,采用磁动势理论推导了气隙中与空间位置无关的脉振磁场的电感矩阵表达式,通过将其引入abc坐标系下对称的电机数学模型,从而构建描述六相圆筒式直线感应电机不对称的数学模型。在Simulink环境下,采用隐式梯形法构建该不对称模型的系统仿真模型。对样机进行仿真分析和实验验证,仿真结果与实验数据吻合良好,验证了模型的正确性。     

幅相误差对声纳均匀线列阵的影响分析

针对幅相误差是制约声纳基阵性能的重要因素,建立存在幅相误差的均匀线列阵模型,进而提出统计计算与计算机仿真相结合的方法。该方法通过计算线列阵方向性函数的统计特性,分析具有幅相误差、基元失效时均匀线列阵对基阵指标的影响。仿真证明理论分析是正确的。     

多因素协调设计提高超视距反舰导弹抗干扰能力

依据超视距反舰导弹的特点和对捕捉概率影响因素的分析,提出一种基于捕捉概率的多因素协调设计的方法,用于提高导弹抗干扰能力.并运用均匀试验设计法统计计算捕捉概率,对仿真结果进行回归分析.最后通过非线性规划对导弹抗干扰能力进行优化计算,论证了该方法的可行性.     

相关系数及其应用

在相关分析中，通常利用相关系数来分析或测定变量之间的线性相关程度。相关系数是描述两个变量或随机变量之间的线性相关程度的指标。相关系数的计算与分析是科学研究中常用的一种简单分析方法，根据相关系数可以对不同事物进行简单的聚类分析等。从相关系数的概念入手，给出相关系数的计算公式，列举了相关系数的应用。     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

VB程序设计课程教学的探索与实践

实践表明，对影响VB程序设计课程教学中存在的突出问题进行认真分析，充分利用网络教学平台，改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣，提高学生的编程能力，同时也有助于提高教学质量和效果。     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

高非线性度弹性S盒的构造

弹性S盒可应用于容错分布计算,量子密码密钥分配和流密码中伪随机序列产生.基于线性码和高非线性度的S盒,给出了一种构造具有高非线性度,且代数次数大于给定值的弹性S盒的方法.对于给定参数的线性码,构造的弹性S盒的非线性度是可以计算的.结果表明所构造的函数的非线性度优于已有的结果.